High Dimensional Consistent Digital Segments
نویسندگان
چکیده
منابع مشابه
High Dimensional Consistent Digital Segments
We consider the problem of digitalizing Euclidean line segments from R to Z. Christ et al. (DCG, 2012) showed how to construct a set of consistent digital segment (CDS) for d = 2: a collection of segments connecting any two points in Z2 that satisfies the natural extension of the Euclidean axioms to Z. In this paper we study the construction of CDSs in higher dimensions. We show that any total ...
متن کاملA Characterization of Consistent Digital Line Segments in Two Dimensions
Our concern is the digitalization of line segments in Z as considered by Chun et al. [5] and Christ et al. [4]. The key property that differentiates the research of Chun et al. and Christ et al. from other research in digital line segment construction is that the intersection of any two segments must be connected. Such a system of segments is called a consistent digital line segments system (CD...
متن کاملTowards Unsupervised and Consistent High Dimensional Data Clustering
The boosted demand for immense information, the enhanced data acquisition and so do the size and number of dimensions of data is a big challenge for the data mining algorithms. Clustering exercise to collect the data with same characteristics together, for better performance of knowledge based systems. High dimensional and large size data results in declined performance of existing clustering a...
متن کاملChoreographies in a high-dimensional self-consistent transport map model
In this work we study the self-consistent chaotic transport of the vorticity in a two dimensional inviscid shear flow. In an active transport problem the advected field determines the velocity field through a dynamical constrain. The advection-diffusion equation can be reduced to a finite dimensional dynamical system given by an areapreserving self-consistent map obtained from a space-time disc...
متن کاملConsistent group selection in high-dimensional linear regression.
In regression problems where covariates can be naturally grouped, the group Lasso is an attractive method for variable selection since it respects the grouping structure in the data. We study the selection and estimation properties of the group Lasso in high-dimensional settings when the number of groups exceeds the sample size. We provide sufficient conditions under which the group Lasso selec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1136572